Adaptive early exit techniques in image correlation

ABSTRACT

Images are obtained for image compression. The images are compared using sum of absolute difference devices, which have arithmetic parts, and accumulators. The sign bits of the accumulators are determined at a time of minimum distortion between two images. These sign bits are associated with sets of probabilistically-similar parts. When other sets from that set are obtained later, an early exit is established.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a divisional application of U.S. application Ser. No. 09/590,028, filed Jun. 7, 2000. The disclosure of the prior application is considered part of (and is incorporated by reference in) the disclosure of this application.

BACKGROUND

Image compression techniques can reduce the amount of data to be transmitted in video applications. This is often done by determining parts of the image that have stayed the same. The “motion estimation” technique is used in various video coding methods.

Motion estimation is an attempt to find the best match between a source block belonging to some frame N and a search area. The search area can be in the same frame N, or can be in a search area in a temporally displaced frame N−k.

These techniques may be computationally intensive.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other aspects will now be described in detail with reference to the accompanying drawings, wherein:

FIG. 1 shows a source block and search block being compared against one another;

FIG. 2 shows a basic accumulation unit for measuring distortion;

FIGS. 3 a and 3 b shows different partitioning of the calculations among multiple SAD units;

FIG. 4 shows a tradeoff between early exit strategy calculations and an actual total calculation;

FIG. 5 shows a flowchart of calculating distortion in a specific device and early exit strategy;

FIG. 6 a shows an early exit using an early exit flag;

FIG. 6 b shows early exit using a hardware status register;

FIG. 7 shows a flowchart of operation of the adaptive early exit strategy.

DETAILED DESCRIPTION

Motion estimation is often carried out by calculating a sum of absolute differences or “SAD”. Motion estimation can be used in many different applications, including, but not limited to cellular telephones that use video, video cameras, video accelerators, and other such devices. These devices can produce video signals as outputs. The SAD is a calculation often used to identify the lowest distortion between a source block and a number of blocks in a search region search block. Hence the best match between these blocks. One way of expressing this is ${{SAD} = {\sum\limits_{i = 0}^{N - 1}\quad{\sum\limits_{j = 0}^{n - 1}\quad{{{a\left( {i,j} \right)} - {b\left( {i,j} \right)}}}}}},{N = 2},4,8,16,32,64.$

Conceptually what this means is that a first frame or source block (N) is divided into component parts of M×N source blocks 100. These are compared to a second frame (N−K) 102. The frames can be temporally displaced, in which case k≠0. Each N−K frame 102 is an M+2m₁×N+2n₁ area. The source block 100 is shown in the center of the area in FIG. 1. The parts of the images that match can be detected by correlating each part of each image frame against other image frame using the distortion measurer.

The compression scheme uses this detection to compress the data, and hence send less information about the image.

This device can also be part of a general-purpose DSP. Such a device is contemplated for use in video camcorders, teleconferencing, PC video cards, and HDTV. In addition, the general-purpose DSP is also contemplated for use in connection with other technologies utilizing digital signal processing such as voice processing used in mobile telephony, speech recognition, and other applications.

The speed of the overall distortion detection process can be increased. One way is by using hardware that allows each SAD device to carry out more operations in a cycle. This, however, can require more expensive hardware.

Another way is to increase the effective pixel throughput by adding additional SAD devices. This can also increase cost, however, since it requires more SAD devices.

Faster search algorithms attempt to use the existing hardware more effectively.

The block SAD compares the source group against the “search group”. The source group and the search group move throughout the entire image so that the SAD operation calculates the overlap between the two groups. Each block in the source group will be compared to multiple blocks in each of the search regions.

A typical SAD unit operates on two, 16 by 16 elements to overlay those elements on one another. This overlay process calculates 16×16=256 differences. These are then accumulated to represent the total distortion.

The SAD requires certain fundamental operations. A difference between the source X_(ij) and the search Y_(ij) must be formed. An absolute value |X_(ij)−Y_(ij)| is formed. Finally, the values are accumulated, ${SAD} = {\sum\limits_{i = 0}^{N - 1}\quad{\sum\limits_{j = 0}^{n - 1}\quad{{{X_{ij} - Y_{ij}}}.}}}$

A basic accumulation structure is shown in FIG. 2 Arithmetic logic unit 200 receives X_(ij) and Y_(ij) from data buses 198,199 connected thereto, and calculates X_(ij)−Y_(ij). The output 201 is inverted by inverter 202. Both the inverted output, and the original, are sent to multiplexer 204 which selects one of the values based on a sign bit 205. A second arithmetic logic unit 206 combines these to form the absolute value. The final values are stored in accumulation register 208. Effectively, this forms a system of subtract, absolute, accumulate, as shown in FIG. 2.

FIG. 2 shows a single SAD computation unit. As noted above, multiple computation units could be used to increases the throughput. If the number of computation units is increased, that increases, in theory, the pixel throughput per cycle.

The present inventor noted, however, that increase in pixel throughput is not necessarily linearly related to the number of units. In fact, each frame is somewhat correlated with its neighboring frames. In addition, different parts of any image are often correlated with other parts of the image. The efficiency of the compression may be based on characteristics of the images. The present application allows using the multiple SAD devices in different modes, depending on the efficiency of compression.

The present application uses the architecture shown in FIGS. 3A and 3B. The same connection is used in both FIGS. 3A and 3B, but the calculations are partitioned in different ways.

FIG. 3A shows each SAD device 300, 302 being configured as a whole SAD. Each SAD receives a different block, providing N block SAD calculations. Effectively, unit 301, therefore, calculates the relationship between a 16 by 16 reference and a 16 by 16 source, pixel by pixel. Unit 2, 302 calculates the result the difference 16 by 16 source and the 16 by 16 search pixel by pixel. The alternative shown in FIG. 3B. In this alternative, configuration each single SAD 300, 302 performs a fraction of a single block SAD calculation. Each of the N computation units provides 1/N of the output. This “partial SAD” operation means that each of the 8 bit subtract absolute accumulate units have calculated 1/N of the full SAD calculation configured to that unit.

The overall system that determines the whole or partial should be used based on previous results as described herein. This in turn can reduce the number of calculations that is carried out.

One way to determine whether whole or partial is used is to assume that temporally close images have correlated properties. A first cycle can be calculated using the whole SAD mode, and a second cycle can be calculated using the partial SAD mode. The cycle which works faster is taken as the winner, and sets the SAD mode. This calculation can be repeated every X cycles, where X is the number of cycles after which local temporal correlation can no longer be assumed. This can be done in a logic unit, which carries out the flowchart of FIG. 7, described herein.

Throughput can also be increased by an “early exit” technique as described herein.

The complete SAD calculation for 16×16 elements can be written as |p₁r−p₁s|+|p₂r−p₂s|+ . . . |p₂₅₆s−p₂₅₆r|  (1). If all of these calculations were actually carried out, the calculation could take 256/N cycles, where N is the number of SAD units. It is desirable to stop the calculation as soon as possible. Interim results of the calculation are tested. These interim results are used to determine if enough information has been determined to find a minimum distortion. The act of testing, however, can consume cycles.

The present application describes a balance between this consumption of cycles and the determination of the minimum distortion. FIG. 4 illustrates the tradeoff for a 16×16 calculation using 4 SAD devices. Line 400 in FIG. 4 represents the cycle count when there is no early exit. The line is horizontal representing that the cycle count without early exit is always 256/4=64.

The cycle counts for early exit strategies are shown in the sloped lines 402, 404, 406 and 408. Line 404 represents one test every sixteen pixels, line 406 represents one test every thirty-two pixels (⅛) and line 408 represents one test every sixty-four pixels ( 1/16). Note that when the lines 402-408 are above line 400, the attempt at early exit has actually increased the overall distortion calculation time. Line 402 represents the cycle consumption where zero overhead is obtained for exit testing. That is, when a test is made, the exit is always successful. Line 402 is the desired goal. An adaptive early exit scheme is disclosed for doing so.

Block I is first processed using any normal strategy known in the art to find a minimum distortion. This can be done using test patterns, which can be part of the actual image, to find the distortion. This minimum distortion is used as the baseline; and it is assumed that block I+n, where n is small, has that same minimum distortion. Two basic parameters are used.

Kexit(N) represents the number of pixels that have been processed previously for a search region before an early exit is achieved.

Aexit(N) represents the state of the partial accumulator sign bits, at the time of the last early exit for a search region.

For these blocks I+n, the SAD calculation is terminated when the distortion exceeds that threshold. This forms a causal system using previous information that is known about the search region.

The usual system is based on the image characteristics within a search region being some probability of maintaining common characteristics from time to time. The time between frames is between 1/15 and 1/30 of second, often fast enough that minimal changes occur during those times above some noise floor related to measurable system characteristics. Also, there are often regions of an image which maintains similar temporal characteristics over time.

According to the present application, the accumulator unit for each SAD can be loaded with the value (−least/n), where “least” represents the minimum distortion that is measured in the block motion search for the region. Many SAD's are calculated for each search region. The first SAD calculating for the region is assigned the “Least” designation. Future SADs are compared to this, to see if a new “Least” value has been established. When the accumulators change sign, the minimum distortion has been reached. Moreover, this is indicated using only the existing SAD structure, without an additional calculation, and hence additional cycle(s) for the test.

A test of the character of the image can be used to determine how many of the accumulators need to switch before establishing the early exit. For example, if source and target regions are totally homogeneous, then all the accumulators should change sign more or less at the same time. When this happens, any one of the running SAD calculations exceeding the previous least measurement can be used to indicate that an early exit is in order.

This, however, assumes total image homogeneity. Such an assumption does not always hold. In many situations, the multiple accumulators of the different SAD units will not be increasing at the same rate. Moreover, the different rate of increase between the accumulators may be related directly to the spatial frequency characteristics of the differences themselves, between the source and target block, and also to the method of sampling the data. This can require more complex ways of considering how to determine early exit, based on what happens with the SAD units.

One operation is based on the probability associated with a split SAD state; where not all of the SAD units are in the same state. This difference in rate of increase between the accumulators is related to the spatial frequency characteristics of the difference between the source and target block. Since these spatial frequency characteristics are also correlated among temporally similar frames, the information from one frame may also be applied to analysis of following frames.

This is explained herein with reference to variables—where A₁, A₂, A₃ . . . A_(n) are defined as events associated with a split SAD calculation.

The events can be defined as follows:

-   -   Event A_(i)=SAD_(i)≧0 where SAD<0 for i≠j.

This conceptually means that the event A_(i) is defined as occuring when SAD unit i is positive and all the remaining SAD units are negative. This would occur, for example, when the accumulators were increasing at different rates. This can also be defined as combined events, specifically:

-   -   Event B_(i,j)=A_(i)∪A_(j)=SAD_(i)≧0 for SAD_(j)≧0, and         where SAD_(k)<0 for k≠i, j. This means that event B_(i,j) is         defined as “true” when A_(i) exists and A_(j) are true, but all         other A_(k) are false. The concept of defining the operations in         terms of events can be extended to include all the possible         combinations of i, j and k. This yields, for 4 SAD units, a         total of 16 combinations. For larger numbers of SAD units, it         leads to other numbers of combinations, and possibly using more         variables, such as i, j, k and m or others.

Describing this scenario in words, each event “B” is defined as the sum of the specified accumulators being greater than 0. Each of these combinations is defined as a probability. For 4 SAD units, there are total of 16 possible states of accumulators. These can be grouped according to how they are handled.

A first trivial possibility is

-   -   P(B|{overscore (A)}₁∩{overscore (A)}₂∩{overscore         (A)}₃∩{overscore (A)}₄)=0.

This means that the probability that sum of the accumulators is >0, given that none of the accumulators has exceeded 0, is 0.

The opposite is. also true:

-   -   P(B|A₁∩A₂∩A₃∩A 4 )=1;         Which means that the probability of the sum of all the         accumulators is set, given that none of them are set, is also 1.

Excluding these trivial characteristics, there are 14 nontrivial combinations. The first group includes four cases where one of the accumulators is set and the remaining three are not set:

-   -   P(B|A₁∪({overscore (A)}₂∩{overscore (A)}₃∩{overscore (A)}₄),     -   P(B|A₂∪({overscore (A)}₁∩{overscore (A)}₃∩{overscore (A)}₄),     -   P(B|A₃∪({overscore (A)}₁∩{overscore (A)}₂∩{overscore (A)}₄),     -   P(B|A₄∪({overscore (A)}₁∩{overscore (A)}₂∩{overscore (A)}₃).

Another group represents those conditions where two of the accumulators are set, and the other two accumulators are not set. These combinations are written as:

-   -   P(B|A₁∩A₂)∪({overscore (A)}₃∩{overscore (A)}₄)     -   P(B|A₁∩A₃)∪({overscore (A)}₂∩{overscore (A)}₄)     -   P(B|(A₁∩A₄)∪({overscore (A)}₂∩{overscore (A)}₃)     -   P(B|A₂∩A₃)∪({overscore (A)}₁∩{overscore (A)}₄)     -   P(B|A₂∩A₄)∪({overscore (A)}₁∩{overscore (A)}₃)     -   P(B|A₃∩A₄)∪({overscore (A)}₁∩{overscore (A)}₂)

Finally, the following group represents the cases where three accumulators are set and one accumulator is not set

-   -   P(B|A₁∩A₂∩A₃)∪{overscore (A)}₄)     -   P(B|A₂∩A₃∩A₄)∪{overscore (A)}₁)     -   P(B|A₁∩A₃∩A₄)∪{overscore (A)}₂)     -   P(B|A₁∩A₂∩A₄)∪{overscore (A)}₃).

The present embodiment recognizes that each of these groups, and in fact each of these situations, represents a different condition in the image. Each group or each situation can be handled differently.

This system operates as above, and as described with reference to the flowchart of FIG. 5. The final goal is to complete the calculation, and hence to exit, sooner. This is shown in FIG. 5 by first, determining matching characteristics of two images; a source image and a search image at 550. The matching characteristics are calculated without any early exit. The minimum distortion is found at 555 and the conditions when that minimum distortion existed are found at 560.

The conditions at 560 can include a grouping type that existed at the time of minimum distortion, or the specific condition among the 14 possibilities.

At 570 a subsequent image part is tested. This subsequent part can be any part that is correlated to the test part. Since temporally correlated images are assumed to be correlated, this can extend to any temporally correlated part.

The image source and search are tested, and a determination of the specific groupings that occurred at the time of minimum distortion is found at 575. An early exit is then established, at 580.

The early exit, once determined, can be carried out in a number of different ways.

FIG. 6 a shows a system of carrying out the early exit using an early exit or “EE” flag. N SAD units are shown, where in this embodiment, N can be 4. Each SAD unit includes the structure discussed above, and specifically ALUs, inverters, and accumulators.

The output of each of the accumulators is coupled to a combinatorial logic unit 600 which arranges the outputs. This can be used to carry out the group determination noted above. The combinatorial logic unit is carried out using discrete logic gates, e.g., defined in hardware definition language. The gates are programmed with an option based on the selected group. Different images and parts may be processed according to different options.

For each option, the combination of states, e.g., the group discussed above, is coded. The combinatorial logic monitors the accumulators of all the SAD units. Each state is output to a multiplexer.

When those accumulators achieve a state that falls within the selected coding, an early exit flag is produced. The early exit flag means that the hardware has determined an appropriate “fit”. This causes the operation to exit.

FIG. 6B shows an alternative system, in which the states of the accumulators are sensed by a hardware status register 600. The status register is set to a specified state by the condition of the accumulators. The status register stores the specified condition that represents the early exit. When that specified condition is reached, the early exit is established.

The way in which the adaptive early exit is used, overall, is described in reference to FIG. 7. At 700, the video frame starts. 705 represents buffering both frame M and frame M+1. 710 is a determination if the block history model needs update. This can be determined by, for example, monitoring of the time since a previous frame update. For example, x seconds can be established as a time before a new update is necessary.

If the model needs updating, then the process continues by loading the accumulators with 0xFF01 and setting the local variable N=1 at 715. At 720, the system obtains SAD search region N and uses the periodic exit test T_(exit)= 1/16 . . . , at step 725 the exit test is performed. If successful, a local variable Kexit(N), which is the pixels before exit and Aexit(N) which is an summary of accumulators 1 through 4 before exit restored. The local variable n is also incremented at step 730. This establishes the local parameters, and the process continues.

In a subsequent cycle the block history of update does not need to be redone at step 710, and hence control passes to step 735. At this step, the previously stored Kexit and AEexit are read. This is used as the new count at step 740 to set target block flags.

At step 745, a search for block N is established, an a exit and Kexit are updated at step 750. N is incremented. At step 755, a determination is made whether N is equal to 397. 397 is taken as the number of frames in the buffer, since there are 396, 16×16 blocks in a 352×288 image. However, this would be adjusted for different size sizes as applicable.

Again, the temporal variations of large portions of an image are likely to remain unchanged. Therefore, when the partial accumulators have a specific sign bit, their state produces significant advantages. Moreover, the time between frames is usually on the order of 1/15 to 1/30 of a second. Finally, regions within the image maintain their localized characteristics, and therefore their spatial frequency may be correlated.

Although only a few embodiments have been disclosed, other modifications are possible. 

1. A method of processing an image, comprising: pre-establishing one or more early exit conditions associated with a plurality of image processing elements, the early exit characteristics indicative of an exit condition for an image processing calculation, wherein completing the image processing calculation in the absence of the early exit condition comprises performing N operations; initiating the image processing calculation using the plurality of image processing elements; determining that the plurality of image processing elements satisfy at least one of the early exit conditions; and exiting the image processing calculation after performing M<N operations based on the determining.
 2. The method of claim 1, wherein a sign bit is associated with a first image processing element, and wherein the at least one early exit conditions comprise a change in value of the sign bit of the first image processing element.
 3. The method of claim 1, wherein a sign bit is associated with each of the image processing elements, and wherein the at least one early exit condition comprises a change in sign bit for a pre-determined number of the image processing elements, wherein the pre-determined number of the image processing elements is less than all of the image processing elements.
 4. The method of claim 1, wherein a sign bit is associated with each of the image processing elements, and wherein the at least one early exit condition comprises a change in sign bit for all of the image processing elements.
 5. The method of claim 1, wherein each of the plurality of image processing elements comprises an accumulator.
 6. The method of claim 1, further comprising: grouping at least some of the plurality of image processing elements into two or more groups; and wherein the one or more early exit conditions comprise states of the groups of the plurality of image processing elements.
 7. The method of claim 1, wherein the image processing calculation comprises a minimum distortion calculation comparing a source block of an image to a plurality of search blocks.
 8. The method of claim 7, wherein the source block comprises a plurality R of source block sub-parts, and wherein each of the search blocks comprise R search block sub-parts.
 9. The method of claim 8, wherein the minimum distortion calculation comprises determining a difference between one of the R source block sub-parts and an associated one of the R search block sub-parts.
 10. The method of claim 9, wherein the plurality of image processing elements comprise P accumulating elements, and wherein N=R/P.
 11. A method comprising: obtaining a source image part and a plurality of search image parts including a first search image part and a second search image part; providing at least one early exit condition indicative of an exit condition for a determination of a minimum distortion between the source image part and the plurality of search image parts; comparing the source image part and the first search image part by performing N operations of a minimum distortion calculation; determining a tentative minimum distortion based on the performing N operations; comparing the source image part and the second search image part using the minimum distortion calculation; exiting the minimum distortion calculation after performing M<N operations of the minimum distortion calculation based on detection of at least one of the at least one early exit conditions.
 12. The method of claim 11, wherein the N operations comprise accumulate operations.
 13. The method of claim 12, wherein an output of the accumulate operations comprises a sign value, and wherein the at least one early exit condition comprises a determination of a change in the sign value for at least one of the accumulate operations.
 14. The method of claim 12, wherein the accumulate operations are performed using a plurality of accumulators.
 15. The method of claim 14, wherein each of the plurality of accumulators comprises an associated sign bit, and wherein the at least one early exit condition comprises a change in value of the sign bit of at least one of the plurality of accumulators.
 16. A method, comprising: determining a plurality of different states of different calculating units; determining, from said states, groupings of possible states, which groupings represent different probabilistic conditions of the images; determining a first state at a first time at which a calculation indicates minimum distortion between two images; and using said first state to indicate an early exit from calculation at a second time.
 17. A method as in claim 16, wherein said using comprises determining if a current state is the same as said first state.
 18. A method as in claim 16, wherein said groupings comprise groupings of sign bits of said calculating units.
 19. A method as in claim 16, further comprising using said calculating to determine information for an MPEG coding.
 20. An image processing system comprising: a plurality of image processing elements, the outputs of the plurality of image processing elements defining a state of an image processing calculation; a combinational logic circuit in communication with the plurality of image processing elements, the combinational logic circuit coded with information indicative of at least one early exit state defining an early exit condition for the image processing calculation; and an output of the combinational logic circuit, the output indicative of whether the state of the image processing calculation corresponds to one of the at least one early exit states.
 21. The image processing system of claim 20, wherein the plurality of image processing elements comprises N accumulators, and wherein the at least one early exit state is chosen from N² possible states of the N accumulators.
 22. The image processing system of claim 20, wherein the N accumulators each have an associated sign bit, and wherein the at least one early exit state is indicative of a possible state of the associated sign bits of the N accumulators.
 23. The image processing system of claim 20, further comprising a multiplexer in communication with the combination logic circuit, and wherein an output of the multiplexer comprises an early exit flag.
 24. An image processing system comprising: a plurality of image processing elements, the outputs of the plurality of image processing elements defining a state of an image processing calculation; a hardware status register in communication with the plurality of image processing elements, the hardware status register loaded with a value representing at least one early exit state defining an early exit condition for the image processing calculation; and an output of the hardware status register, the output indicative of whether the state of the image processing calculation corresponds to one of the at least one early exit states.
 25. The image processing system of claim 24, wherein the plurality of image processing elements comprises N accumulators, and wherein the at least one early exit state is chosen from N² possible states of the N accumulators.
 26. An image processing system comprising: a memory configured to store video data comprising source image data and search image data, the search image data including first search image data and second search data; a data bus in communication with the memory; and a processor in communication with the data bus and configured to receive the video data over the data bus, the processor comprising: a plurality of image processing elements, each of the image processing elements configured to perform at least a part of a distortion calculation comparing the source image data and the search image data, each of the plurality of image processing elements characterized by a state during the distortion calculation; and wherein the processor is further configured to perform a complete distortion calculation using the source image data and the first search data, and to perform less than a complete distortion calculation using the source image block data and the second search block data based on a state of at least one of the plurality of image processing elements.
 27. The system of claim 26, wherein each of the plurality of image processing elements comprises an associated accumulating element.
 28. The system of claim 27, wherein each of the associated accumulating elements comprises memory storing a magnitude of the accumulating element and a sign bit indicative of a sign of the accumulating element, and wherein the state of an associated image processing element comprises a value of the sign bit.
 29. The system of claim 28, wherein the processor is configured to terminate the distortion calculation after performing less than the complete distortion calculation based on a detecting a change in at least one sign bit.
 30. The system of claim 28, wherein the processor is configured to terminate the distortion calculation after performing less than the complete distortion calculation based on detecting a change in each sign bit. 